Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
نویسندگان
چکیده
We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems using membrane rules with permitting contexts and working in different derivation modes.
منابع مشابه
Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts
The aim of this paper is to study the power of parallel multiset-rewriting systems with permitting or forbidding context (or P systems with non-cooperative rules with promoters or inhibitors). The main results obtained say that if we use promoters or inhibitors of weight two, then the systems are computational universal. Moreover, both constructions satisfy a special property we define: they ar...
متن کامل(Tissue) P Systems Using Non-cooperative Rules Without Halting Conditions
We consider (tissue) P systems using non-cooperative rules, but considering computations without halting conditions. As results of a computation we take the contents of a specified output membrane/cell in each derivation step, no matter whether this computation will ever halt or not, eventually taking only results completely consisting of terminal objects only. The computational power of (tissu...
متن کاملOn the Power of P Systems with Symport Rules
A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals pass together in the same direction) and antiport rules (one chemical enters and the other exits a membrane), one obtains the computational completeness, and the question was formulated what happens when only symport rul...
متن کاملP Systems with Antiport Rules for Evolution Rules
We investigate a variant of evolution-communication P systems where the computation is performed in two substeps. First, all possible antiport rules are applied in a non-deterministic, maximally parallel way, moving evolution rules across membranes. In the second substep, evolution rules are applied to suitable objects in a maximally parallel way, too. Thus, objects can be the subject of change...
متن کامل(Ultimately Confluent) Parallel Multiset–Rewriting Systems with Context
The aim of this paper is to study the power of parallel multisetrewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satisfies a special property we define: it is ultimately confluent. This means that if the system allows at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007